Node Embedding with Adaptive Similarities for Scalable Learning over Graphs
نویسندگان
چکیده
منابع مشابه
Clustering graphs for visualization via node similarities
Graph visualization is commonly used to visually model relations in many areas. Examples include Web sites, CASE tools, and knowledge representation. When the amount of information in these graphs becomes too large, users, however, cannot perceive all elements at the same time. A clustered graph can greatly reduce visual complexity by temporarily replacing a set of nodes in clusters with abstra...
متن کاملOn the effect of low-quality node observation on learning over incremental adaptive networks
In this paper, we study the impact of low-quality node on the performance of incremental least mean square (ILMS) adaptive networks. Adaptive networks involve many nodes with adaptation and learning capabilities. Low-quality mode in the performance of a node in a practical sensor network is modeled by the observation of pure noise (its observation noise) that leads to an unreliable measurement....
متن کاملScalable Metric Learning for Co-Embedding
We present a general formulation of metric learning for co-embedding, where the goal is to relate objects from different sets. The framework allows metric learning to be applied to a wide range of problems—including link prediction, relation learning, multi-label tagging and ranking—while allowing training to be reformulated as convex optimization. For training we provide a fast iterative algor...
متن کاملGraph2Seq: Scalable Learning Dynamics for Graphs
Neural networks have been shown to be an effective tool for learning algorithms over graphstructured data. However, graph representation techniques—that convert graphs to real-valued vectors for use with neural networks—are still in their infancy. Recent works have proposed several approaches (e.g., graph convolutional networks), but these methods have difficulty scaling and generalizing to gra...
متن کاملLearning with Multiple Similarities Learning with Multiple Similarities
Title of dissertation: LEARNINGWITHMULTIPLE SIMILARITIES Abhishek Kumar, Doctor of Philosophy, 2013 Dissertation directed by: Professor Hal Daumé III Department of Computer Science The notion of similarities between data points is central to many classification and clustering algorithms. We often encounter situations when there are more than one set of pairwise similarity graphs between objects...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2019
ISSN: 1041-4347,1558-2191,2326-3865
DOI: 10.1109/tkde.2019.2931542